CurryHoward correspondence

Results: 45



#Item
31Type theory / Logic in computer science / Models of computation / Computability theory / Metalogic / Model theory / Simply typed lambda calculus / Lambda calculus / CurryHoward correspondence / Intuitionistic type theory

Uniqueness Typing Simplified—Technical Appendix Edsko de Vries∗ Department of Computer Science Trinity College Dublin, Ireland August 13, 2008

Add to Reading List

Source URL: www.edsko.net

Language: English - Date: 2016-08-02 06:27:04
32Constructible universe / Expected value / Ordinal number / Distribution / Probability distributions / Beta distribution / CurryHoward correspondence

c ACM, 2007. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. ° Not for redistribution. The definitive version was published in the Proceedings of the Haskell Wor

Add to Reading List

Source URL: community.haskell.org

Language: English - Date: 2013-10-12 04:58:09
33Proof theory / Algebraic geometry / Computability theory / Lambda calculus / Theoretical computer science / Sequent / Valuation / CurryHoward correspondence / Quantum group

1 Almost Affine Lambda Terms Makoto Kanazawa National Institute of Informatics, Tokyo, Japan

Add to Reading List

Source URL: research.nii.ac.jp

Language: English - Date: 2014-08-19 13:21:10
34Ordinal number / Wellfoundedness / Constructible universe / Symbol / Closed and exact differential forms / NC / CurryHoward correspondence / Generalised Whitehead product

553 Documenta Math. A Modular Compactification of the General Linear Group

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2001-01-17 12:27:51
35Ordinal numbers / Type theory / Computability theory / Recursion / Constructible universe / Lambda calculus / Standard ML / Recursive data type / Fold / CurryHoward correspondence

Truly Modular (Co)datatypes for Isabelle/HOL Jasmin Christian Blanchette1 , Johannes Hölzl1 , Andreas Lochbihler2 , Lorenz Panny1 , Andrei Popescu1,3 , and Dmitriy Traytel1 1 3

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-01-25 16:18:54
36Mathematical analysis / Analysis / Constructible universe / Expected value / Ordinal number / Distribution / Probability distributions / Beta distribution / CurryHoward correspondence

c ACM, 2007. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. ° Not for redistribution. The definitive version was published in the Proceedings of the Haskell Wor

Add to Reading List

Source URL: ndmitchell.com

Language: English - Date: 2016-04-19 09:56:22
37Circuit complexity / NC / Constructible universe / Proof theory / Ordinal numbers / Probability distributions / Abstraction / Mathematics / CurryHoward correspondence / Ordinal arithmetic

Online Learning for Time Series Prediction Elad Hazan Shie Mannor Ohad Shamir

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-02-27 20:17:13
38Algebra / Mathematical logic / Mathematics / Algebraic logic / Fuzzy logic / MV-algebra / Many-valued logic / Constructible universe / Lie algebras / Boolean algebra / Ordinal number / CurryHoward correspondence

The logic of quasi true Antonio Di Nola1 , Revaz Grigolia2 and Giacomo Lenzi1 1 2

Add to Reading List

Source URL: logica.dmi.unisa.it

Language: English - Date: 2015-05-18 15:13:07
39Type theory / Functional languages / Proof assistants / Dependently typed programming / Logic in computer science / Coq / Dependent type / Functional programming / Haskell / Inductive type / Quicksort / CurryHoward correspondence

Types in functional languages Dependent types and the Propositions-as-Types Isomorphism The Coq system and inductive types Rich types for programming and proving Radboud University Nijmegen

Add to Reading List

Source URL: www.cs.ru.nl

Language: English - Date: 2015-01-06 13:25:00
40Logic in computer science / Theoretical computer science / Mathematics / Constructible universe / Mathematical logic / CurryHoward correspondence / Table of stars with Bayer designations / Generalised Whitehead product

On the Complexity of Abstract Categorial Grammars In this abstract we investigate the respective complexities of the membership and the universal membership problems for Abstract Categorial Grammars [dG01]. This problem

Add to Reading List

Source URL: wwwhomes.uni-bielefeld.de

Language: English - Date: 2009-05-22 03:48:32
UPDATE